‘Gem’ Pear

Prickly pear

Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width

The P4 is the induced path of four vertices. The gem consists of a P4 with an additional universal vertex being completely adjacent to the P4, and the co-gem is its complement graph. Gemand co-gem-free graphs generalize the popular class of cographs (i. e. P4-free graphs). The tree structure and algebraic generation of cographs has been crucial for several concepts of graph decomposition such a...

The PEAR proposition.

For more than a quarter century, the Princeton Engineering Anomalies Research (PEAR) laboratory has engaged in a broad range of experiments on consciousness-related physical anomalies and has proposed a corresponding selection of theoretical models that have combined to illuminate the fundamental nature of the provocative phenomena that emerge. Productive pursuit of this topic has inescapably i...

GEM studies for LCTPC

The LCTPC collaboration is developing a time projection chamber (TPC) for a future linear collider. In the ILD concept for an ILC detector a TPC is foreseen as main tracking device. In order to get measurable signals on the anode, the primary electrons, produced by charged particles traversing the TPC, have to be multiplied. For this purpose gas electron multipliers (GEMs) can be used. Studies ...

Generalizing Gauss's Gem

= 1 or −1 according as j is or is not a quadratic residue mod p. A multivariable generalization of Theorem 1.1 follows. Theorem 1.1 is a special case of Theorem 1.2 with x3 = · · · = xp = 0. Theorem 1.2. Let p be an odd prime and p = (−1)(p−1)/2p. Then there exist integer polynomials R(x1, x2, . . . , xp) and S(x1, x2, . . . , xp) such that 4 · det(circ(x1, x2, . . . , xp)) x1 + x2 + · · ·+ xp ...